Description: VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-VC + + programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. Here l is the linear complexity. Platform: |
Size: 30926 |
Author:赖晖 |
Hits:
Description: VC＋＋编程实现了二元域的BM算法。Berlekamp-Massey 算法是一个少有的高效算法。只需要输入密文中的2l个比特，就可以产生LFSR的最小多项式，从而生成整个序列。这里的l是系统的线性复杂度。-VC++ programming domain of the dual BM algorithm. Berlekamp-Massey algorithm is a rare efficient algorithm. Just type of dense text 2l bits, we can have the minimal polynomial LFSR, resulting in the formation of the entire sequence. Here l is the linear complexity. Platform: |
Size: 1911808 |
Author:赖晖 |
Hits:
Description: The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order -The main features of the considered identification problem are that there is no an a priori separation of the variables into inputs and outputs and the approximation criterion, called misfit, does not depend on the model representation. The misfit is defined as the minimum of the l2-norm between the given time series and a time series that is consistent with the approximate model. The misfit is equal to zero if and only if the model is exact and the smaller the misfit is (by definition) the more accurate the model is. The considered model class consists of all linear time-invariant systems of bounded complexity and the complexity is specified by the number of inputs and the smallest number of lags in a difference equation representation. We present a Matlab function for approximate identification based on misfit minimization. Although the problem formulation is representation independent, we use input/state/output representations of the system in order Platform: |
Size: 1031168 |
Author:kedle |
Hits:
Description: 一条实现自定义复杂线性的一种方法，很简杂，值得参考-Since the definition of a realization of a method of linear complexity, is simple hybrid, it is also useful. . Platform: |
Size: 23552 |
Author:yanglihui |
Hits:
Description: 一个画笔辅助类，可以方便使用各种自定义的复杂线型，如点点划线。-Supporting a brush-type, can be easily customized using a variety of linear complexity, such as the little crossed. Platform: |
Size: 38912 |
Author:ironsteel |
Hits:
Description: Progran in C to evaluate Linear complexity of cryptographically significant binary sequences Platform: |
Size: 1024 |
Author:Musheer |
Hits:
Description: 1stOpt 是七维高科有限公司（7D-Soft High Technology Inc.）独立开发，
拥有完全自主知识产权的一套数学优化分析综合工具软件包。在非线性回归，曲线拟合，非线性复杂模型参数估算求解，线性/非线性规划等领域首屈一指；
1stOpt 应用范围
1) 模型自动优化率定
2) 参数估算
3) 任意模型公式线性，非线性拟合，回归
4) 非线性连立方程组求解
5) 任意维函数，隐函数极值求解
6) 隐函数根求解，作图，求极值
7) 线性，非线性及整数规划
8) 组合优化问题
9) 高级计算器
附带指导文件-1stOpt Hi-Tech Co., Ltd. is one of the seven-dimensional (7D-Soft High Technology Inc.) Independently developed, have complete independent intellectual property rights of a set of integrated tools for analysis of mathematical optimization software package. In the non-linear regression, curve fitting, non-linear model parameters to estimate the complexity of solving linear/nonlinear programming in areas such as second to none 1stOpt scope of application 1) model to automatically optimize rate 2) parameter estimation 3) any model of the formula line sexual, non-linear fitting, regression 4) non-linear simultaneous equations to solve even 5) arbitrary-dimensional function, implicit function solving extremum 6) implicit function solving the root, mapping, and extreme value 7) of linear, non-linear and integer programming 8) combinatorial optimization problem 9) high-level guidance document attached calculator Platform: |
Size: 7420928 |
Author:zhangqi |
Hits:
Description: Counting sort algorithm is a linear complexity algorithm. i programmed it using c# 2003. Platform: |
Size: 15360 |
Author:banihani |
Hits:
Description: 考虑整数线性规划问题max（ci*xi）试设计一个解此问题的动态规划算法，并分析算法的计算复杂性-Consider the integer linear programming problem max (ci* xi) try to design a solution of this problem, dynamic programming algorithm, and analysis of algorithms computational complexity Platform: |
Size: 2048 |
Author:wu |
Hits:
Description: The Berlekamp-Massey algorithm is an efficient algorithm for determining the linear complexity of a finite binary sequence sn of length n. The algorithm takes n iterations, with the Nth iteration computing the linear complexity of the subsequence sN consisting of the first N terms of sn. Returned value (L) is the length of the shortest linear feedback shift register sequence that generates all bits in sequence sn. Platform: |
Size: 1024 |
Author:Maor Karisi |
Hits:
Description: In this paper, we show how support vector machine (SVM) can be
employed as a powerful tool for $k$-nearest neighbor (kNN)
classifier. A novel multi-class dimensionality reduction approach,
Discriminant Analysis via Support Vectors (SVDA), is introduced by
using the SVM. The kernel mapping idea is used to derive the
non-linear version, Kernel Discriminant via Support Vectors (SVKD).
In SVDA, only support vectors are involved to obtain the
transformation matrix. Thus, the computational complexity can be
greatly reduced for kernel based feature extraction. Experiments
carried out on several standard databases show a clear improvement
on LDA-based recognition Platform: |
Size: 2048 |
Author:sofi |
Hits:
Description: This paper introduces linear constellation precoding
(LCP) for OFDM transmissions over frequency-selective
fading channels. Exploiting the correlation structure
of OFDM subchannels, and choosing system parameters
properly, we first perform optimal subcarrier grouping
to divide the set of correlated subchannels into subsets.
Within each subset, a non-redundant constellation-specijic
unitary precoder is then designed to achieve maximum
multipath diversity and coding gains. While greatly reducing
the decoding complexity and simplifiing the LCP
design, subcarrier grouping offers optimal perjormance by
maximizing multipath diversity and coding gains. In addition,
the proposed system does not sacrifice the transmission
rate. Analytic evaluation and corroborating simulations
reveal its pe$ormance merits. Platform: |
Size: 460800 |
Author:ashish |
Hits:
Description: ：基于脑电信号的身份识别是通过采集试验者的脑部信号来进行身份认证。对于同一个外部刺激或者主体在思考同一个
事件的时候，不同人的大脑所产生的认知脑电信号不同。选取与运动意识想象有关的电极后，分析不同个体在特定状况下脑
电的个体差异，采用以回归系数、能量谱密度、相同步、线性复杂度多种信号处理结合方法对运动想象脑电信号进行处理来
进行特征提取。组合多元特征向量并运用多层BP 神经网络对不同个体的脑电信号进行分类，并在不同的意识想象及不同数
据长度、不同的波段对试验者进行识别率验证分析。结果表明，不同运动想象的平均识别率均在80 以上，其中以想象舌头
运动的识别率较高，达到90.6 ，不同波段的识别率也表明意识想象的模式及相应波段对身份认别有较大的影响。-EEG-based identification to authenticate through the acquisition of experimental brain signals. For the same external stimuli, or the main thinking of the same
Event, different people s brains produced by cognitive EEG. Select imagine the electrodes and movement awareness, analysis of different individuals in a particular situation brain
Individual differences in electricity, the use of regression coefficients, the energy spectral density, phase synchronization, the linear complexity of a variety of signal processing combined with motor imagery EEG
For feature extraction. The combination of multiple feature vectors and the use of multi-layer BP neural network to classify the EEG signals of different individuals, and in a different sense of imagination and a different number of
Length, the band on the test to verify the analysis of the recognition rate. The results show that the average recognition rates of different motor imagery in more than 80 , which to imagine the tongue
The m Platform: |
Size: 551936 |
Author:王闯杰 |
Hits:
Description: 密码学中用于计算周期系列的2-错线性复杂度的程序。-Cryptography is used to calculate periodic series 2- error linear complexity of the procedure. Platform: |
Size: 1024 |
Author:wangjun |
Hits:
Description: Logistic映射系统的每一个值都与它前面的那个值不存在确定的关系，但是后一个值的取值取决于前一个值，Logistic映射动力方程具有足够高的线性复杂度。
-Logistic mapping system each value and that value in front of it there is no definite relations, but after a value of value depends on the previous value, Logistic mapping dynamic equation has a sufficiently high linear complexity. Platform: |
Size: 253952 |
Author:梦郎 |
Hits:
Description: 一类新的pqr长2阶广义分圆序列的线性复杂度-The linear complexity of a class of new PQR 2 order generalized fractal sequences Platform: |
Size: 637952 |
Author:xiaowang |
Hits:
Search - linear complexity